CircularTrip: An Effective Algorithm for Continuous k NN Queries
نویسندگان
چکیده
Continuously monitoring kNN queries in a highly dynamic environment has become a necessity to many recent location-based applications. In this paper, we study the problem of continuous kNN query on the dataset with an in-memory grid index. We first present a novel data access method – CircularTrip. Then, an efficient CircularTrip-based continuous kNN algorithm is developed. Compared with the existing algorithms, our algorithm is both space and time efficient.
منابع مشابه
Neighbor Queries in Location- Dependent Application
A k nearest neighbor (k-NN) query retrieves k objects in a given objects set which are closest to the query point q. Processing continuous k-nearest neighbor (k-NN) query over moving objects in location-dependent application requires that the frequent location updates of moving objects and intensive continuous k-NN queries must be efficiently processed at the same time. In this paper, we propos...
متن کاملOptimized Seizure Detection Algorithm: A Fast Approach for Onset of Epileptic in EEG Signals Using GT Discriminant Analysis and K-NN Classifier
Background: Epilepsy is a severe disorder of the central nervous system that predisposes the person to recurrent seizures. Fifty million people worldwide suffer from epilepsy; after Alzheimer’s and stroke, it is the third widespread nervous disorder.Objective: In this paper, an algorithm to detect the onset of epileptic seizures based on the analysis of brain electrical signals (EEG) has b...
متن کاملAn Efficient and Scalable Approach to CNN Queries in a Road Network
A continuous search in a road network retrieves the objects which satisfy a query condition at any point on a path. For example, return the three nearest restaurants from all locations on my route from point s to point e. In this paper, we deal with NN queries as well as continuous NN queries in the context of moving objects databases. The performance of existing approaches based on the network...
متن کاملKyriakos MOURATIDIS School of Information Systems
Continuous Nearest Neighbor Monitoring A k nearest neighbor (k-NN) query retrieves the k objects in a dataset that lie closest to a given query point. There exist numerous approaches for efficient k-NN processing over static datasets. Recently, however, the research focus has shifted towards dynamic environments where (i) the data objects and the query points move in an unpredictable manner, an...
متن کاملارائه مدلی غیرپارامتریک با استفاده از تکنیک k- نزدیکترین همسایه در برآورد جرم مخصوص ظاهری خاک
Soil bulk density measurements are often required as an input parameter for models that predict soil processes. Nonparametric approaches are being used in various fields to estimate continuous variables. One type of the nonparametric lazy learning algorithms, a k-nearest neighbor (k-NN) algorithm was introduced and tested to estimate soil bulk density from other soil properties, including soil ...
متن کامل